https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7826 Sat 24 Mar 2018 08:37:39 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7820 Sat 24 Mar 2018 08:37:36 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7645 t, and girth (length of shortest cycle) at least g ≥ t + 1. In 1975, Erdős proposed the problem of determining the extremal numbers ex(n;4) of a graph of n vertices and girth at least 5. In this paper, we consider a generalized version of this problem, for t ≥ 5. In particular, we prove that ex(n;6) for n = 29, 30 and 31 is equal to 45, 47 and 49, respectively.]]> Sat 24 Mar 2018 08:35:58 AEDT ]]>